Percolation transition in networks with degree-degree correlation
نویسندگان
چکیده
منابع مشابه
Synchronization in weighted scale free networks with degree-degree correlation
We study synchronization phenomena in scale-free networks of asymmetrically coupled dynamical systems featuring degree-degree correlation in the topology of the connection wiring. We show that when the interaction is dominant from the high-degree to the low-degree (from the low-degree to the high degree) nodes, synchronization is enhanced for assortative (disassortative) degree-degree correlati...
متن کاملJamming in complex networks with degree correlation
We study the effects of the degree-degree correlations on the pressure congestion J when we apply a dynamical process on scale free complex networks using the gradient network approach. We find that the pressure congestion for disassortative (assortative) networks is lower (bigger) than the one for uncorrelated networks which allow us to affirm that disassortative networks enhance transport thr...
متن کاملPercolation of spatially constrained Erdős-Rényi networks with degree correlations.
Motivated by experiments on activity in neuronal cultures [ J. Soriano, M. Rodríguez Martínez, T. Tlusty and E. Moses Proc. Natl. Acad. Sci. 105 13758 (2008)], we investigate the percolation transition and critical exponents of spatially embedded Erdős-Rényi networks with degree correlations. In our model networks, nodes are randomly distributed in a two-dimensional spatial domain, and the conn...
متن کاملSynchronization in Scale Free networks with degree correlation
C. E. La Rocca, L. A. Braunstein, 2 and P. A. Macri Instituto de Investigaciones F́ısicas de Mar del Plata (IFIMAR)-Departamento de F́ısica, Facultad de Ciencias Exactas y Naturales, Universidad Nacional de Mar del Plata-CONICET, Funes 3350, (7600) Mar del Plata, Argentina. Center for Polymer Studies, Boston University, Boston, Massachusetts 02215, USA Abstract In this paper we study a model of s...
متن کاملGeneralized friendship paradox in networks with tunable degree-attribute correlation
One of the interesting phenomena due to topological heterogeneities in complex networks is the friendship paradox: Your friends have on average more friends than you do. Recently, this paradox has been generalized for arbitrary node attributes, called the generalized friendship paradox (GFP). The origin of GFP at the network level has been shown to be rooted in positive correlations between deg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2007
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.76.026116